Local Conditions for Exponentially Many Subdivisions
نویسندگان
چکیده
منابع مشابه
Local Conditions for Exponentially Many Subdivisions
Given a graph F , let st(F ) be the number of subdivisions of F , each with a different vertex set, which one can guarantee in a graph G in which every edge lies in at least t copies of F . In 1990, Tuza asked for which graphs F and large t, one has that st(F ) is exponential in a power of t. We show that, somewhat surprisingly, the only such F are complete graphs, and for every F which is not ...
متن کاملExponentially many local minima for single neurons
We show that for a single neuron with the logistic function as the transfer function the number of local minima of the error function based on the square loss can grow exponentially in the dimension.
متن کاملExponentially many supertrees
The amalgamation of leaf-labelled trees into a single supertree that displays each of the input trees is an important problem in classification. Clearly, there can be more than one (super) tree for a given set of input trees, in particular if a highly unresolved supertree exists. Here, we show (by explicit construction) that even if every supertree of a given collection of input trees is binary...
متن کاملSUBDIVISIONS AND LOCAL h-VECTORS
In Part I a general theory of f-vectors of simplicial subdivisions (ortriangulations) of simplicial complexes is developed, based on the concept of lo-cal h-vector. As an application, we prove that the h-vector of a Cohen-Macaulaycomplex increases under "quasi-geometric" subdivision, thus establishing a spe-cial case of a conjecture of Kalai and this author. Techniques include c...
متن کاملLocal Routing in Convex Subdivisions
In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2016
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548316000365